Jealousy Graphs: Structure and Complexity of Decentralized Stable Matching
نویسندگان
چکیده
The stable matching problem has many applications to real world markets and efficient centralized algorithms are known. However, little is known about the decentralized case. Several natural randomized algorithmic models for this setting have been proposed but they have worst case exponential time in expectation. We present a novel structure associated with a stable matching on a matching market. Using this structure, we are able to provide a finer analysis of the complexity of a subclass of decentralized matching markets.
منابع مشابه
Matching Integral Graphs of Small Order
In this paper, we study matching integral graphs of small order. A graph is called matching integral if the zeros of its matching polynomial are all integers. Matching integral graphs were first studied by Akbari, Khalashi, etc. They characterized all traceable graphs which are matching integral. They studied matching integral regular graphs. Furthermore, it has been shown that there is no matc...
متن کاملInstability of matchings in decentralized markets with various preference structures
In any two-sided matching market, a stable matching can be found by a central agency using the deferred acceptance procedure of Gale and Shapley. But if the market is decentralized and information is incomplete then stability of the ensuing matching is not to be expected. Despite the prevalence of such matching situations, and the importance of stability, little theory exists concerning instabi...
متن کاملAnti-forcing number of some specific graphs
Let $G=(V,E)$ be a simple connected graph. A perfect matching (or Kekul'e structure in chemical literature) of $G$ is a set of disjoint edges which covers all vertices of $G$. The anti-forcing number of $G$ is the smallest number of edges such that the remaining graph obtained by deleting these edges has a unique perfect matching and is denoted by $af(G)$. In this paper we consider some specifi...
متن کاملDesigning scenarios related to emotional and sexual jealousy and examining the factor structure and its internal consistency
Purpose: The purpose of this study was to design emotional and sexual infidelity scenarios and to examine the factor structure and its internal consistency in a sample of Iranian students and staff. Method:In this research, 104 men and 96 women were selected with an average of 19-30 age and using multistage cluster sampling. The researcher-made questionnaire and scenarios are the tools of this ...
متن کاملTwo-sided popular matchings in bipartite graphs with forbidden/forced elements and weights
Two-sided popular matchings in bipartite graphs are a well-known generalization of stable matchings in the marriage setting, and they are especially relevant when preference lists are incomplete. In this case, the cardinality of a stable matching can be as small as half the size of a maximum matching. Popular matchings allow for assignments of larger size while still guaranteeing a certain fair...
متن کامل